Sharp edge, vertex, and mixed Cheeger type inequalities for finite Markov kernels

نویسنده

  • Ravi Montenegro
چکیده

We show how the evolving set methodology of Morris and Peres can be used to show Cheeger inequalities for bounding the spectral gap of a finite Markov kernel. This leads to sharp versions of several previous Cheeger inequalities, including ones involving edge-expansion, vertex-expansion, and mixtures of both. A bound on the smallest eigenvalue also follows.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Edge, Vertex, and Mixed Cheeger Inequalities for Finite Markov Kernels

We use the evolving set methodology of Morris and Peres to show Cheeger inequalities for bounding the spectral gap of a finite ergodic Markov kernel. This leads to sharp versions of several previous inequalities, including ones involving edge-expansion and/or vertex-expansion. A bound on the smallest eigenvalue also follows

متن کامل

Laplacians of graphs and Cheeger inequalities

We define the Laplacian for a general graph and then examine several isoperimetric inequalities which relate the eigenvalues of the Laplacian to a number of graphs invariants such as vertex or edge expansions and the isoperimetric dimension of a graph.

متن کامل

Inequality and Kernel Estimates for Functions of the Laplacian on a Graph

This paper introduces certain elliptic Harnack inequalities for harmonic functions in the setting of the product space M × X, where M is a (weighted) Riemannian Manifold and X is a countable graph. Since some standard arguments for the elliptic case fail in this “mixed” setting, we adapt ideas from the discrete parabolic case found in the paper [7] of Delmotte. We then present some useful appli...

متن کامل

Discrete/continuous elliptic Harnack inequality and kernel estimates for functions of the Laplacian on a graph

This paper introduces certain elliptic Harnack inequalities for harmonic functions in the setting of the product space M×X, where M is a (weighted) Riemannian manifold and X is a countable (symmetrically weighted) graph. Since some standard arguments for the elliptic case fail in this “mixed” setting, we adapt ideas from the discrete parabolic case found in Delmotte, 1999. We then present some ...

متن کامل

Log-sobolev, Isoperimetry and Transport Inequalities on Graphs

In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007